One-Way Communication Complexity of Computing a Collection of Rational Functions
نویسندگان
چکیده
منابع مشابه
One-Way Communication Complexity of Symmetric Boolean Functions
We study deterministic one-way communication complexity of functions with Hankel communication matrices. Some structural properties of such matrices are established and applied to the one-way two-party communication complexity of symmetric Boolean functions. It is shown that the number of required communication bits does not depend on the communication direction, provided that neither direction...
متن کاملOne- Way Functions and Circuit Complexity
A finite function f is a mapping of {1 , 2 ,. .. , m } into {1 , 2 ,. .. , m } ∪ { # } where # is a symbol to be thought of as ''undefined.'' This paper defines a measure M(f) of the difficulty of inverting a finite function f, which is given by M(f) = MIN log 2 C(f) log 2 C(g) _ _________ : g an inverse of f where C(f) is a circuit complexity measure of the difficulty of computing ...
متن کاملGeneric case complexity and One-Way functions
Generic case complexity has originated about a decade ago in combinatorial group theory [10, 2]. This area has long computational traditions with many fundamental problems being algorithmic in nature. It has been shown that most computational problems in infinite group theory are recursively undecidable. However, it was also observed that decision algorithms, sometimes very naive ones, exist fo...
متن کاملa contrastive study of rhetorical functions of citation in iranian and international elt scopus journals
writing an academic article requires the researchers to provide support for their works by learning how to cite the works of others. various studies regarding the analysis of citation in m.a theses have been done, while little work has been done on comparison of citations among elt scopus journal articles, and so the dearth of research in this area demands for further investigation into citatio...
Tight Bounds on Communication Complexity of Symmetric XOR Functions in One-Way and SMP Models
We study the communication complexity of symmetric XOR functions, namely functions f : {0, 1}×{0, 1} → {0, 1} that can be formulated as f(x, y) = D(|x⊕ y|) for some predicate D : {0, 1, ..., n} → {0, 1}, where |x⊕ y| is the Hamming weight of the bitwise XOR of x and y. We give a public-coin randomized protocol in the Simultaneous Message Passing (SMP) model, with the communication cost matching...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Complexity
سال: 1994
ISSN: 0885-064X
DOI: 10.1006/jcom.1994.1008